A Column-Generation Based Tactical Planning Method for Inventory Routing
نویسندگان
چکیده
منابع مشابه
Inventory Routing Problem solved by Heuristic based on Column Generation
We consider an application of the inventory routing problem. A fleet of vehicles is devoted to collecting a single product from geographically dispersed sites. Each site has its own accumulation rate and stock capacity. On each visit, the vehicle empties the stock. At the tactical level, the objective is to minimize the fleet size and an estimate of the distance travelled. Moreover, for practic...
متن کاملIntegrated Airline Planning
The tactical planning process of an airline is typically decomposed into several stages among which fleeting, aircraft routing, and crew pairing form the core. In such a decomposed and sequential approach the output of fleeting forms the input to aircraft routing and crew pairing. In turn, the output to aircraft routing is part of the input to crew pairing. Due to the decomposition, the resulti...
متن کاملA realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm
In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...
متن کاملInventory Location Routing Problem: A Column Generation Approach
This paper presents a solution method based on column generation for the Inventory Location Routing Problem. It chooses simultaneously the location of a set of depots to decide upon the inventory management and the set of routes to satisfy customers’ demands, in order to minimize the total system cost. The original problem is decomposed into a Master Problem (Location Problem) and an Auxiliary ...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 60 شماره
صفحات -
تاریخ انتشار 2012